Performance Analysis of Concurrent Red-Black Trees on HTM Platforms
نویسندگان
چکیده
In this paper we analyze the performance of concurrent redblack trees using two HTM implementations, Intel’s Transactional Synchronization Extensions (TSX) on Haswell processors and IBM’s Power8 HTM. We parallelize bottom-up and top-down red-black trees using coarse-grained transactions and evaluate their performance. Our experimental results show that HTM can outperform lock-based implementations with minimal programming effort. Furthermore, they reveal that scalability depends on limits imposed by the underlying hardware, indicating that a programmer needs to take them into account in order to utilize HTM efficiently.
منابع مشابه
Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees
In this paper we combine Hardware Transactional Memory (HTM) with Read-Copy-Update (RCU) to implement highly scalable concurrent balanced Binary Search Trees (BSTs). The two key features of our approach are: a) read-only operations require no synchronization or restarts and b) tree modifications are first performed in private copies of subtrees, then HTM is used to validate their consistency, a...
متن کاملThe Performance of Concurrent Red-Black Tree Algorithms
Relaxed balancing has become a commonly used concept in the design of concurrent search tree algorithms. The idea of relaxed balancing is to uncouple the rebalancing from the updating in order to speed up the update operations and to allow a high degree of concurrency. Many di erent relaxed balancing algorithms have been proposed, especially for red-black trees and AVL trees, but their performa...
متن کاملConcurrent Rebalancing on HyperRed-Black Trees
The HyperRed-Black trees are a relaxed version of RedBlack trees accepting high degree of concurrency. In the Red-Black trees consecutive red nodes are forbidden. This restriction has been withdrawn in the Chromatic trees. They have been introduced by O. Nurmi and E. Soisalon-Soininen to work in a concurrent environment. A Chromatic tree can have big clusters of red nodes surrounded by black no...
متن کاملRelativistic red-black trees
Operating system performance and scalability on sharedmemory many-core systems depends critically on efficient access to shared data structures. Scalability has proven difficult to achieve for many data structures. In this paper we present a novel and highly scalable concurrent red-black tree. Red-black trees are widely used in operating systems, but typically exhibit poor scalability. Our red-...
متن کاملA Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures (Invited Paper)
Concurrent and parallel algorithms are different. However, in the case of dictionaries, both kinds of algorithms share many common points. We present a unified approach emphasizing these points. It is based on a careful analysis of the sequential algorithm, extracting from it the more basic facts, encapsulated later on as local rules. We apply the method to the insertion algorithms in AVL trees...
متن کامل